An Efficient Parallel Block Backpropagation Learning Algorithm in Transputer-Based Mesh-Connected Parallel Computers∗

نویسنده

  • Han-Wook LEE
چکیده

Learning process is essential for good performance when a neural network is applied to a practical application. The backpropagation algorithm [1] is a well-known learning method widely used in most neural networks. However, since the backpropagation algorithm is time-consuming, much research have been done to speed up the process. The block backpropagation algorithm, which seems to be more efficient than the backpropagation, is recently proposed by Coetzee in [2]. In this paper, we propose an efficient parallel algorithm for the block backpropagation method and its performance model in meshconnected parallel computer systems. The proposed algorithm adopts master-slave model for weight broadcasting and data parallelism for computation of weights. In order to validate our performance model, a neural network is implemented for printed character recognition application in the TiME [3] which is a prototype parallel machine consisting of 32 transputers connected in mesh topology. It is shown that speedup by our performance model is very close to that by experiments. key words: block backpropagation, parallel computing, load balancing, transputer

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Implementations of Neural Network Simulations

At the present time, backpropagation is the most popular learning algorithm for multilayer feedforward neural networks. It can be expressed in the formalism of vector or matrix algebra : extensions of scalar operations and matrix products. These operations can be performed with a high degree of parallelism. Three architectures involving loosely coupled processors are considered: torus, mesh and...

متن کامل

A parallel version of some block preconditionings

The block preconditioned conjugate gradient (BPCG) methods, even if very effective for solving the linear systems deriving from the discretization of partial differential equations, are not efficient for parallel computers. The bottleneck for their parallel implementation is represented by the solution of the linear system to obtain the preconditioned residual. Here, we present a parallel versi...

متن کامل

1 An Efficient Parallel Ray Tracing Scheme for Highly Parallel Architectures

The production of realistic image generated by computer requires a huge amount of computation and a large memory capacity. The use of highly parallel com­ puters allows this process to be performed faster. Distributed memory parallel computers (DMPCs), such as hypercubes or transputer-based machines, offer an attractive perfor­ mance/cost ratio when the load balancing has been balance and the p...

متن کامل

An Efficient Parallel Ray Tracing Scheme for Highly Parallel Architectures

The production of realistic image generated by computer requires a huge amount of computation and a large memory capacity. The use of highly parallel computers allows this process to be performed faster. Distributed memory parallel computers (DMPCs), such as hypercubes or transputer-based machines, ooer an attractive performance/cost ratio when the load balancing has been balance and the partit...

متن کامل

A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect

Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000